package com.atcumt.bytedance;

import java.util.Scanner;

public class BT02 {

    /**
     * 分割等和子集：将这个数组分割成两个子集，使得两个子集的元素和相等。
     * dp[i][j]: 从前 i 个物品里任意取，放进容量为j的背包，价值总和最大是多少
     */
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int[] nums = new int[n];
        for (int i = 0; i < n; i++) {
            nums[i] = scan.nextInt();
        }

        int sum = 0;
        for (int num : nums) {
            sum += num;
        }
        if (sum % 2 != 0) {
            System.out.println("false");
        }
        int target = sum / 2;
        int[] dp = new int[target + 1];
        for (int i = 0; i < n; i++) {
            for (int j = target; j >= nums[i]; j--) {
                dp[j] = Math.max(dp[j], dp[j - nums[i]] + nums[i]);
            }
        }
        System.out.println(dp[target] == target);
    }
}
